Constrained Sequential Pattern Knowledge in Multi-relational Learning

In this work we present XMuSer, a multi-relational framework suitable to explore temporal patterns available in multi-relational databases. XMuSer’s main idea consists of exploiting frequent sequence mining, using an efficient and direct method to learn temporal patterns in the form of sequences. Grounded on a coding methodology and on the efficiency of sequential miners, we find the most interesting sequential patterns available and then map these findings into a new table, which encodes the multi-relational timed data using sequential patterns. In the last step of our framework, we use an ILP algorithm to learn a theory on the enlarged relational database that consists on the original multi-relational database and the new sequence relation. We evaluate our framework addressing three classification problems and running three different sequence miners. Using each one of the sequence miners we can find: all the frequent sequences, all the closed sequences or all the maximal sequences.